- Boolean class
- SAP.фин. логический класс
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Boolean grammar — Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context free grammars, with conjunction and negation operations. Besides these explicit operations, Boolean grammars… … Wikipedia
Boolean analysis — was introduced by Flament (1976). The goal of a Boolean analysis is to detect deterministic dependencies between the items of a questionnaire in observed response patterns. These deterministic dependencies have the form of logical formulas… … Wikipedia
Class (format de fichier) — Classe Java Extension de fichier .class Type MIME application/java vm Développé par Sun Microsystems Type de format … Wikipédia en Français
Boolean datatype — In computer science, the Boolean datatype, sometimes called the logical datatype , is a primitive datatype having one of two values: true and false. Many systems represent true as non zero (often 1, or 1) and false as zero . It is the special… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Boolean-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Class (set theory) — In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) which can be unambiguously defined by a property that all its members share. The precise definition of class… … Wikipedia
Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia
Boolean delay equation — As a novel type of semi discrete dynamical systems, Boolean Delay Equations (BDEs) are models with Boolean valued variables that evolve in continuous time. Since at the present time, most phenomena are too complex to be modeled by partial… … Wikipedia